Truncation length for Viterbi decoding
نویسنده
چکیده
A bound is derived and analyzed for the bit error rate (BER) of a Viterbi decoder with survivor truncation. Estimates of the SNR loss on the AWGN channel, due to truncation are obtained for convolutional codes. Larger truncation lengths are required than the smallest value that does not effectively decrease the code’s free distance, especially at low Eb/No.
منابع مشابه
Truncation Effects in Viterbi Decoding
Practical Viterbi decoders often fall significantly short of full maximum likelihood decoding (MLD) pe;formance because of survivor truncation efiects. In this paper, we study the tradeoff between truncation length and performance loss for the two most common variations of Viterbi’s algorithm: best state decoding (BSD) and fized state decoding (FSD). We find that FSD survivors should be about t...
متن کاملMinimum decoding trellis length and truncation depth of wrap-around Viterbi algorithm for TBCC in mobile WiMAX
The performance of the wrap-around Viterbi decoding algorithm with finite truncation depth and fixed decoding trellis length is investigated for tail-biting convolutional codes in the mobile WiMAX standard. Upper bounds on the error probabilities induced by finite truncation depth and the uncertainty of the initial state are derived for the AWGN channel. The truncation depth and the decoding tr...
متن کاملA Reduced-State Viterbi Algorithm for Blind Sequence Estimation of DPSK Sources
The Viterbi algorithm is the optimum decoding algorithm for convolutional codes and has often served as a standard technique in digital communication systems for maximum likelihood sequence estimation. With the Viterbi Algorithm, the computational complexity increases exponentially with the constraint length of the convolutional code. Reducing the constraint length (hence the number of states) ...
متن کاملTwo decoding algorithms for tailbiting codes
This paper presents two efficient Viterbi decoding-based suboptimal algorithms for tailbiting codes. The first algorithm, called the wrap-around Viterbi algorithm (WAVA), falls into the circular decoding category. It processes the tailbiting trellis iteratively, explores the initial state of the transmitted sequence through continuous Viterbi decoding, and improves the decoding decision with it...
متن کاملEffect of imperfect power control on acquisition performance in a DS/CDMA system - Electronics Letters
the proposed algorithm with the same truiicafion length in the Viterbi decoder. The results show that the error-correction capability of the proposed algorithm is significantly improved over that of the existing algorithm. When truncation length is set to 25 and channel error is 5%, the existing algorithm cannot correct 0.242% of errors, while the proposed algorithm reduces it to 10.088% These ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Communications
دوره 39 شماره
صفحات -
تاریخ انتشار 1991